package offer;

public class Offer14 {


    public int cuttingRope(int n) {
        int[] dp=new int[n+1];
        dp[1]=1;

        for (int i =2; i <=n; i++) {
            for (int j = 1; j <i ; j++) {
                dp[i]=Math.max(Math.max(j*(i-j),j*dp[i-j]), dp[i]);
            }
        }
        return dp[n];

    }
}
